Classification of Quasigroups by Random Walk on Torus
نویسندگان
چکیده
Quasigroups are algebraic structures closely related to Latin squares which have many different applications. There are several classifications of quasigroups based on their algebraic properties. In this paper we propose another classification based on the properties of strings obtained by specific quasigroup transformations. More precisely, in our research we identified some quasigroup transformations which can be applied to arbitrary strings to produce pseudo random sequences. We performed tests for randomness of the obtained pseudo-random sequences by random walks on torus. The randomness tests provided an empirical classification of quasigroups.
منابع مشابه
Random Walk on a Discrete Torus and Ran- Dom Interlacements
We investigate the relation between the local picture left by the trajectory of a simple random walk on the torus (Z/NZ), d ≥ 3, until uN time steps, u > 0, and the model of random interlacements recently introduced by Sznitman [9]. In particular, we show that for large N , the joint distribution of the local pictures in the neighborhoods of finitely many distant points left by the walk up to t...
متن کاملThe loop - erased random walk and the uniform spanning tree on the four - dimensional discrete torus
Let x and y be points chosen uniformly at random from Z4n, the four-dimensional discrete torus with side length n. We show that the length of the loop-erased random walk from x to y is of order n(logn), resolving a conjecture of Benjamini and Kozma. We also show that the scaling limit of the uniform spanning tree on Z4n is the Brownian continuum random tree of Aldous. Our proofs use the techniq...
متن کاملRandom walks on the torus with several generators
Given n vectors {~ αi}i=1 ∈ [0, 1), consider a random walk on the ddimensional torus T = R/Z generated by these vectors by successive addition and subtraction. For certain sets of vectors, this walk converges to Haar (uniform) measure on the torus. We show that the discrepancy distance D(Q) between the k-th step distribution of the walk and Haar measure is bounded below byD(Q) ≥ C1k, where C1 =...
متن کاملOn the fragmentation of a torus by random walk
Abstract. We consider a simple random walk on a discrete torus (Z/NZ) with dimension d ≥ 3 and large side length N . For a fixed constant u ≥ 0, we study the percolative properties of the vacant set, consisting of the set of vertices not visited by the random walk in its first [uN] steps. We prove the existence of two distinct phases of the vacant set in the following sense: if u > 0 is chosen ...
متن کاملGiant Component and Vacant Set for Random Walk on a Discrete Torus
We consider random walk on a discrete torus E of side-length N , in sufficiently high dimension d. We investigate the percolative properties of the vacant set corresponding to the collection of sites which have not been visited by the walk up to time uNd. We show that when u is chosen small, as N tends to infinity, there is with overwhelming probability a unique connected component in the vacan...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004